// Problem: 
// Contest: 
// URL: 
// Memory Limit: 
// Time Limit: 
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
bool cmp(int x,int y)
{
	if(x>y)return 1;
	else return 0;
}
int maxo(vector<int> v)
{
	int m=-1e10;
	int ret=0;
	int n=v.size();
	for(int i=0;i<n;i++)
	{
		if(v[i]>m&&v[i]%2==0)
		{
			ret=i;
			m=v[i];
		}
	}
	return ret;
}
int maxj(vector<int> v)
{
	int m=-1e10;
	int ret=0;
	int n=v.size();
	for(int i=0;i<n;i++)
	{
		if(v[i]>m&&v[i]%2==1)
		{
			ret=i;
			m=v[i];
		}
	}
	return ret;
}
signed main()
{
	int n,m,k;
	cin>>n>>m>>k;
	vector<int> v(n);
	for(int i=0;i<n;i++)
	{
		cin>>v[i];
	}
	sort(v.begin(),v.end());
	while(m!=0)
	{
		if(v[maxo(v)]>v[maxj(v)])
		{
			v[maxo(v)]/=2;
			m--;
		}
		else 
		{
			if(k!=0&&(maxj(v)!=0||v[maxj(v)]%2==1))
			{
				v[maxj(v)]^=1;
				k--;
			}
			else
			{
				if(maxo(v)==0&&v[maxo(v)]%2==1)break;
				v[maxo(v)]/=2;
				m--;
			}
		}
	}
	int ret=0;
	for(int i=0;i<n;i++)
	{
		if(k!=0&&v[i]%2==1)
		{
			v[i]^=1;
			k--;
		}
		//cout<<v[i]<<" ";
		ret+=v[i];
	}
	cout<<ret;
	return 0;
}
